Hash-Based Paging and Location Update Using Bloom Filters

Hash-Based Paging and Location Update Using Bloom Filters

We develop and analyze a hash-based paging and location update technique that reduces the paging cost in cellular systems. By applying a Bloom filter, the terminal identifier field of a paging message is coded to page a number of terminals concurrently. A small number of terminals may wake up and send what we call “false location updates” although they are not being paged. We compare the total ...

Fast and deterministic hash table lookup using discriminative bloom filters

Hash tables are widely used in network applications, as they can achieve O(1) query, insert, and delete operations at moderate loads. However, at high loads, collisions are prevalent in the table, which increases the access time and induces non-deterministic performance. Slow rates and non-determinism can considerably hurt the performance and scalability of hash tables in the multi-threaded par...

Fractional Hybrid Movement-distance-based Location Update with Selective Paging

In this paper we propose a fractional movement-distance-based location update scheme for Personal Communication Service PCS network. Indeed it is a location update scheme which is mobile terminal (MT ) dependent. Each MT stores a set of cells within a distance H , in terms of cells, from the cell where the last update occurred. The MT can then move freely within a ring distance Hl = H − 1 witho...

Tradeoff analysis for location update and paging in wireless networks

Location management plays the central role in providing ubiquitous communications services in the future wireless mobile networks. Location update and paging are commonly used in tracking mobile users on the move, location update is to update a mobile user’s current location while the paging is used to locate a mobile user, both will incur signaling traffic in the wireless networks. The more fr...

Mobile user location update and paging under delay constraints